Description: C#实现的最短路径AStar算法,是我见过最好的AStar算法。-c# shortest path AStar calculation, It is the best calculation I ve ever seen Platform: |
Size: 65536 |
Author:杨波 |
Hits:
Description: Windows应用程序，C#编写，实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点（该点是一个可以点击的按钮），这些按钮按照出现的先后顺序自动从1开始编号（目前程序设定最多支持100个点，可自行更改）。界面右上角是计算结果显示区，往下是权值输入区和“连线”、“清屏”“计算”三个按钮以及状态区，状态区显示当前的起点和终点，连线和计算都要用到该信息（点击生成的顺序编号的那些按钮可以依次改变起点和终点）。输入权值后点“连线”则把编号为状态区显示的起点和终点连接起来，并在线的中央标明权值。点击“计算”则计算状态区显示的起点和终点的最短距离及路径，并将结果输出到右上角。右下角为异常显示区，显示程序运行过程中出现的异常，比如权值输入一个字母，因字母无法转为整型，就会产生异常，该异常信息就显示在右下角。-Windows applications, C#, for the realization of the Dijkstra shortest path algorithm, convenient operation, the procedure can own interface on a point each designated location, gaps at the interface of each click generated a point (the point is a can click on the button), these buttons with the automatic sequence starting from No. 1 (the current procedure set up to support 100 points can make changes). Instructions interface is calculated results show, right down the value of the importation and the "Alliance" "screen" "calculated" button and the three state area, the current state of the district show the starting and finishing points. Alliance and calculation should use the information (click generation of serial numbers of those buttons can be followed to Platform: |
Size: 11264 |
Author: |
Hits:
Description: vb+Mapinfo开发之最短路径，同时还有SQL查询等功能-vb+ Mapinfo development of the shortest path, along with features such as SQL Query Platform: |
Size: 179200 |
Author:李健 |
Hits:
Description: 基于AE用c#来实现最短路径分析的功能。可以查询距离最近的点。-Based on AE with c# to achieve the shortest path analysis functions. Can query the nearest point. Platform: |
Size: 101376 |
Author:李艳 |
Hits:
Description: 该系统是一个GIS的导航系统，具有GIS的基本功能以及最短路径分析、专题图功能等。利用ArcGIS Engine9.3以及Visual Studio 2005开发的。-The navigation system is a GIS system with the basic functions of GIS and the shortest path analysis, thematic map functions. Using ArcGIS Engine9.3 and Visual Studio 2005 development. Platform: |
Size: 169984 |
Author:古 |
Hits:
Description: Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。CSHARP实现算法
-Dijkstra algorithm is a typical shortest path algorithm, used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm can come up with the most short-circuit path of the optimal solution, but because a lot of it traversing the computing node, so the efficiency is low. Dijkstra algorithm is a step-by-step search algorithm, to work to keep up to find the shortest path from m to n for each vertex n. CSHARP realization algorithm Platform: |
Size: 2048 |
Author: |
Hits:
Description: 基于Csharp的最短路径分析源代码，用arcengine组件进行组装-Based on the Csharp the shortest path analysis of the source code, with arcengine components to be assembled Platform: |
Size: 8192 |
Author:jason |
Hits:
Search - Shortest Path with csharp